OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
نویسندگان
چکیده
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an integration of two techniques: a correlogram matrix based technique to generate all the frequent 1and 2-itemset in a single scan over the database and a technique that uses vertical layout concept to generate the rest of the frequent itemsets. The proposed technique also supports interactive mining of 1and 2-element frequent itemsets. We experimented with several synthetic datasets and compared the performance of OPAM with its other counterparts i.e. Apriori and FPgrowth and found satisfactory.
منابع مشابه
Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint
In this paper, we propose a novel data structure called CATS Tree. CATS Tree extends the idea of FPTree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. The proposed algorithms enable frequent pattern mining with different supports without rebuilding the tree structure. Furthermore, the algorithms allow mining with a single pass over the...
متن کاملEffective Positive Negative Association Rule Mining Using Improved Frequent Pattern Tree
Association Rule is an important tool for today data mining technique. But this work only concern with positive rule generation till now. This paper gives study for generating negative and positive rule generation as demand of modern data mining techniques requirements. Here also gives detail of “A method for generating all positive and negative Association Rules” (PNAR). PNAR help to generates...
متن کاملEffective Positive Negative Association Rule Mining Using Improved Frequent Pattern
Association Rule is an important tool for today data mining technique. But this work only concern with positive rule generation till now. This paper gives study for generating negative and positive rule generation as demand of modern data mining techniques requirements. Here also gives detail of “A method for generating all positive and negative Association Rules” (PNAR). PNAR help to generates...
متن کاملUsing Pattern Decomposition Methods for Finding All Frequent Patterns in Large Datasets
Efficient algorithms to mine frequent patterns are crucial to many tasks in data mining. Since the Apriori algorithm was proposed in 1994, there have been several methods proposed to improve its performance. However, most still adopt its candidate set generation-and-test approach. In addition, many methods do not generate all frequent patterns, making them inadequate to derive association rules...
متن کاملBasic Framework of CATSIM Tree for Efficient Frequent Pattern Mining
Finding frequent patterns from databases have been the most time consuming process in association rule mining. Several effective data structures, such as two-dimensional arrays, graphs, trees and tries have been proposed to collect candidate itemsets and frequent itemsets. It seems that the tree structure is most extractive to storing itemsets. The outstanding tree has been proposed so far is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCIT
دوره 3 شماره
صفحات -
تاریخ انتشار 2008